Quantum-Fourier-transform-based quantum arithmetic with qudits

نویسندگان

چکیده

We present some basic integer arithmetic quantum circuits, such as adders and multiplier-accumulators of various forms, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several circuits operating Fourier-transformed appeared the literature for two-level qubits. Here we extend these techniques qudits, may offer advantages relative qubit implementations. presented here can used building blocks higher level algorithms phase estimation, simulation, optimization, etc. Detailed decomposition is given down elementary single- two-qudit gates most appropriate physical implementation. A complexity analysis this step it shown that depth linear number qudits employed quadratic dimension each qudit while their cost dimension.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform

We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier transformed integers have appeared in the literat...

متن کامل

Fourier-transform quantum state tomography

We propose a technique for performing quantum state tomography of photonic polarization-encoded multiqubit states. Our method uses a single rotating wave plate, a polarizing beam splitter, and two photon-counting detectors per photon mode. As the wave plate rotates, the photon counters measure a pseudocontinuous signal which is then Fourier transformed. The density matrix of the state is recons...

متن کامل

A quantum Fourier transform algorithm

Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits needed to achieve a desired tolerance, allowing simulation of the algorithm.

متن کامل

Quantum operation, quantum Fourier transform and semi-definite programming

We analyze a class of quantum operations based on a geometrical representation of d−level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier transform, is found for this class of operations. A more general class of operations on qudits is also considered and its completely positive condition is reduced to t...

متن کامل

A relation between quantum operations and the quantum Fourier transform

We propose a general geometry representation of d-level quantum system (or qudit for short). Then we define a general class of operations for qudits. A sufficient and necessary condition of when an operation in the class would be a legal quantum operation is found. This condition is expressed in terms of the quantum Fourier transform. As an application of this condition, we recover the optimal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2021

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.103.032417